Competitive facility location: the Voronoi game

نویسندگان

  • Hee-Kap Ahn
  • Siu-Wing Cheng
  • Otfried Cheong
  • Mordecai J. Golin
  • René van Oostrum
چکیده

We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearest-neighbor rule, and the player whose points control the larger area wins. We present a winning strategy for the second player, where the arena is a circle or a line segment. We also consider a variation where players can play more than one point at a time for the circle arena.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the facility location problem: One-round weighted Voronoi game

Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...

متن کامل

Voronoi Game on Graphs

Voronoi game is a geometric model of competitive facility location problem played between two players. Users are generally modeled as points uniformly distributed on a given underlying space. Each player chooses a set of points in the underlying space to place their facilities. Each user avails service from its nearest facility. Service zone of a facility consists of the set of users which are ...

متن کامل

The Discrete One-round Voronoi Game: Optimizing the First Player Strategy by Integer Programming

The discrete Voronoi game is a mathematical model for the competitive facility location problem with two players where each one must place a total of p facilities on a graph. Each node on the graph is an applicant facility of either player or a customer. Each customer is dominated by the player who owns the nearest placed facility generating a profit for the player who dominates it. Each player...

متن کامل

One-Round Discrete Voronoi Game in ℝ2 in Presence of Existing Facilities

In this paper we consider a simplified variant of the discrete Voronoi Game in R, which is also of independent interest in competitive facility location. The game consists of two players P1 and P2, and a finite set U of users in the plane. The players have already placed two sets of facilities F and S, respectively in the plane. The game begins by P1 placing a new facility followed by P2 placin...

متن کامل

The discrete Voronoi game in R2

In this paper we study the last round of the discrete Voronoi game in R, a problem which is also of independent interest in competitive facility location. The game consists of two players P1 and P2, and a finite set U of users in the plane. The players have already placed two disjoint sets of facilities F and S, respectively in the plane. The game begins with P1 placing a new facility followed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 310  شماره 

صفحات  -

تاریخ انتشار 2004